Non Interleaving Process Algebra
نویسندگان
چکیده
Reduction and Topology, p. 28.
منابع مشابه
A Non–Interleaving Semantics for MSC
In this paper, we develop a non–interleaving semantics and an interleaving semantics for MSC’96 based on the model of families of partially ordered sets. These semantics are no denotational semantics, but are defined via translations of the textual syntax for MSC’96 into a process algebra. We show that the interleaving semantics agrees on BMSC with the standardized semantics for MSC’92, while t...
متن کاملPartial-Order Process Algebra
To date, many different formalisms exist for describing and analyzing the behavior of concurrent systems. Petri nets and process algebras are two well-known classes of such formalisms. Petri-net theory is well suited for reasoning about concurrent systems in a partial-order framework; it handles causal relationships between actions of concurrent systems in an explicit way. Process algebras, on ...
متن کاملProcess algebra with strategic interleaving
In process algebras such as ACP, parallel processes are considered to be interleaved in an arbitrary way. In the case of multi-threading as found in contemporary programming languages, parallel processes are actually interleaved according to some interleaving strategy. Interleaving strategies are also known as process-scheduling policies. In many systems, for instance hardware/software systems,...
متن کاملStochastic Analysis via a Probabilistic Process Algebra
We propose a probabilistic process algebra built on top of a fully parallel calculus. Being strongly inspired by LOTOS, our model allows for multi-party synchronization in process parallel composition. Anyway, departing from LOTOS, it has a non-interleaving, multiset, semantics: Independent actions are performed simultaneously, whereas synchronization is achieved by means of the minimal, implic...
متن کاملGraph isomorphism models for non interleaving process algebra
Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks, p. 73. A general conservative extension tbeorem in process algebra, p. 17. Job Shop Scheduling by Constraint Satisfaction, p. 22. A Hierarchical Membership Protocol for Synchronous Distributed Systems, p. 43. Temporal operators viewed as predica...
متن کامل